Dependency Links Can Hinder the Evolution of Cooperation in the Prisoner’s Dilemma Game on Lattices and Networks
نویسندگان
چکیده
Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner's dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whose value is between the payoff of mutual cooperation and the value of temptation to defect. Thus, this mechanism reflects that the dependency relation is stronger than the relation of ordinary mutual cooperation, but it is not large enough to cause the defection of the dependency pair. We show that the dependence of individuals hinders, promotes and never affects the cooperation on regular ring networks, square lattice, random and scale-free networks, respectively. The results for the square lattice and regular ring networks are demonstrated by the pair approximation.
منابع مشابه
Modeling Cooperation between Nodes in Wireless Networks by APD Game
Cooperation is the foundation of many protocols in wireless networks. Without cooperation, the performance of a network significantly decreases. Hence, all nodes in traditional networks are required to cooperate with each other. In this paper, instead of traditional networks, a network of rational and autonomous nodes is considered, which means that each node itself can decide whe...
متن کاملModeling Cooperation between Nodes in Wireless Networks by APD Game
Cooperation is the foundation of many protocols in wireless networks. Without cooperation, the performance of a network significantly decreases. Hence, all nodes in traditional networks are required to cooperate with each other. In this paper, instead of traditional networks, a network of rational and autonomous nodes is considered, which means that each node itself can decide whe...
متن کاملEmergence of multilevel selection in the prisoner's dilemma game on coevolving random networks
We study the evolution of cooperation in the prisoner’s dilemma game, whereby a coevolutionary rule is introduced that molds the random topology of the interaction network in two ways. First, existing links are deleted whenever a player adopts a new strategy or its degree exceeds a threshold value, and second, new links are added randomly after a given number of game iterations. These coevoluti...
متن کاملCoevolution of strategies and update rules in the Prisoner's Dilemma game on complex networks
In this work we study a weak Prisoner’s Dilemma game in which both strategies and update rules are subjected to evolutionary pressure. Interactions among agents are specified by complex topologies, and we consider both homogeneous and heterogeneous situations. We consider deterministic and stochastic update rules for the strategies, which in turn may consider single links or full context when s...
متن کاملPrisoner’s Dilemma on community networks
We introduce a community network model which exhibits scale-free property and study the evolutionary Prisoner’s Dilemma game (PDG) on this network model. It is found that the frequency of cooperators decreases with the increment of the average degree k̄ from the simulation results. And reducing inter-community links can promote cooperation when we keep the total links (including inner-community ...
متن کامل